Congruences, Infix and Cohesive Prefix Codes
نویسندگان
چکیده
Ito, M. and G. Thierrin, Congruences, infix and cohesive prefix codes, Theoretical Computer Science 136 (1994) 471 485. A language L _~ X * is called a cohesive prefix code if xLyc~L ~ 0 implies that y = 1 and xL c L for any x, y~X*. An example of cohesive prefix codes is an infix code. We determine first the structure of cohesive prefix codes and then we study several relationships between maximal infix codes and maximal cohesive prefix codes. Finally, we determine the structure of a cohesive prefix code that is a right semaphore code.
منابع مشابه
Infix Congruences on a Free Monoid
A congruence p on a free monoid X* is said to be infix if each class C of p satisfies u e C and xuy € C imply xy = 1 . The main purpose of this paper is a characterization of commutative maximal infix congruences. These turn out to be congruences induced by homomorphisms t from X* to N° , the monoid of nonnegative integers under addition, with T"1(0) = 1.
متن کاملProduct of Finite Maximal P-Codes
Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y...
متن کاملK-catenation and applications: k-prefix codes.dvi
Some generalizations of the usual operations of catenation and quotient of languages are introduced and studied. In particular, language equations involving these operations are considered. Infinite hierarchies of classes of prefix codes and classes of equivalence relations are defined and investigated in connection respectively with the classical notions of prefix codes and right syntactic con...
متن کاملPrefix and infix probability computation in PRISM
This paper presents the recent progress concerning prefix and infix probability for PCFGs in a logic-based modeling language PRISM. A prefix is an initial substring of a sentence and likewise an infix is a substring that occurs within a sentence. The prefix probability computation is already introduced to PRISM but applications are still scarce. We describe a new application to web data that id...
متن کاملGeneralizations of Code Languages with Marginal Errors
We study k-prefix-free, k-suffix-free and k-infix-free languages that generalize prefix-free, suffix-free and infix-free languages by allowing marginal errors. For example, a string x in a k-prefix-free language L can be a prefix of up to k different strings in L. Namely, a code (language) can allow some marginal errors. We also define finitely prefix-free languages in which a string x can be a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 136 شماره
صفحات -
تاریخ انتشار 1994